منابع مشابه
A mixture model for random graphs
The Erdös–Rényi model of a network is simple and possesses many explicit expressions for average and asymptotic properties, but it does not fit well to real-world networks. The vertices of those networks are often structured in unknown classes (functionally related proteins or social communities) with different connectivity properties. The stochastic block structures model was proposed for this...
متن کاملProperties of variational estimates of a mixture model for random graphs
Mixture models for random graphs have a complex dependency structure and a likelihood which is not computable even for moderate size networks. Variational and variational Bayes techniques are useful approaches for statistical inference of such complex models but their theoretical properties are not well known. We give a result about the consistency of variational estimates of the parameters of ...
متن کاملA Point-Mass Mixture Random Effects Model for Pitching Metrics
A plethora of statistics have been proposed to measure the effectiveness of pitchers in Major League Baseball. While many of these are quite traditional (e.g., ERA, wins), some have gained currency only recently (e.g., WHIP, K/BB). Some of these metrics may have predictive power, but it is unclear which are the most reliable or consistent. We address this question by constructing a Bayesian ran...
متن کاملShrinkage simplex-centroid designs for a quadratic mixture model
A simplex-centroid design for q mixture components comprises of all possible subsets of the q components, present in equal proportions. The design does not contain full mixture blends except the overall centroid. In real-life situations, all mixture blends comprise of at least a minimum proportion of each component. Here, we introduce simplex-centroid designs which contain complete blend...
متن کاملPoisson cloning model for random graphs
In the random graph G(n, p) with pn bounded, the degrees of the vertices are almost i.i.d. Poisson random variables with mean λ := p(n− 1). Motivated by this fact, we introduce the Poisson cloning model GPC(n, p) for random graphs in which the degrees are i.i.d. Poisson random variables with mean λ. We first establish a theorem that shows that the new model is equivalent to the classical model ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics and Computing
سال: 2007
ISSN: 0960-3174,1573-1375
DOI: 10.1007/s11222-007-9046-7